Rank-preserving diagonal completions of a matrix
نویسندگان
چکیده
منابع مشابه
A Matrix and Its Inverse: Revisiting Minimal Rank Completions
We revisit a formula that connects the minimal ranks of triangular parts of a matrix and its inverse and relate the result to structured rank matrices. We also address the generic minimal rank problem.
متن کاملA new graph parameter related to bounded rank positive semidefinite matrix completions
The Gram dimension gd(G) of a graph G is the smallest integer k ≥ 1 such that any partial real symmetric matrix, whose entries are specified on the diagonal and at the off-diagonal positions corresponding to edges of G, can be completed to a positive semidefinite matrix of rank at most k (assuming a positive semidefinite completion exists). For any fixed k the class of graphs satisfying gd(G) ≤...
متن کاملDiagonal Matrix Reduction over Refinement Rings
Abstract: A ring R is called a refinement ring if the monoid of finitely generated projective R- modules is refinement. Let R be a commutative refinement ring and M, N, be two finitely generated projective R-nodules, then M~N if and only if Mm ~Nm for all maximal ideal m of R. A rectangular matrix A over R admits diagonal reduction if there exit invertible matrices p and Q such that PAQ is...
متن کاملCompletions of P-matrix patterns
A list of positions in an n × n real matrix (a pattern) is said to have P-completion if every partial P-matrix that specifies exactly these positions can be completed to a P-matrix. We extend work of Johnson and Kroschel [JK] by proving a larger class of patterns has Pcompletion, including any 4 × 4 pattern with eight or fewer off-diagonal positions. We also show that any pattern whose digraph ...
متن کاملDiagonal and Monomial Solutions of the Matrix Equation AXB=C
In this article, we consider the matrix equation $AXB=C$, where A, B, C are given matrices and give new necessary and sufficient conditions for the existence of the diagonal solutions and monomial solutions to this equation. We also present a general form of such solutions. Moreover, we consider the least squares problem $min_X |C-AXB |_F$ where $X$ is a diagonal or monomial matrix. The explici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1987
ISSN: 0024-3795
DOI: 10.1016/0024-3795(87)90207-2